Local bounded cochain projections
نویسندگان
چکیده
منابع مشابه
Local bounded cochain projections
We construct projections from HΛk(Ω), the space of differential k forms on Ω which belong to L2(Ω) and whose exterior derivative also belongs to L2(Ω), to finite dimensional subspaces of HΛk(Ω) consisting of piecewise polynomial differential forms defined on a simplicial mesh of Ω. Thus, their definition requires less smoothness than assumed for the definition of the canonical interpolants base...
متن کاملDouble complexes and local cochain projections
The construction of projection operators, which commute with the exterior derivative and at the same time are bounded in the proper Sobolev spaces, represents a key tool in the recent stability analysis of finite element exterior calculus. These so-called bounded cochain projections have been constructed by combining a smoothing operator and the unbounded canonical projections defined by the de...
متن کاملResource-Bounded Local Computation
This paper proposes a generic approximation method for solving the problem of inference under limited computational resources. The method is based on the concept of valuation algebras with its wide range of possible instantiations in many different domains. The goal is to construct convenient resource-bounded anytime algorithms, for which the available time to perform the local computations is ...
متن کاملDuality for Cochain Dg Algebras
This paper develops a duality theory for connected cochain DG algebras, with particular emphasis on the non-commutative aspects. One of the main items is a dualizing DG module which induces a duality between the derived categories of DG left-modules and DG right-modules with finitely generated cohomology. As an application, it is proved that if the canonical module A/A has a semi-free resolutio...
متن کاملSymmetry-Breaking Formulas for Groups with Bounded Orbit Projections
This paper consider the problem of generating symmetry-breaking formulas for permutation groups acting on n points, where the projection of the group into each orbit is bounded by a polynomial in n. We show that the lex-leader formula, which is satisfied by the lexicographic leader of each set of symmetrical points in the search space, can be generated in polynomial time (and space). Our constr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 2014
ISSN: 0025-5718,1088-6842
DOI: 10.1090/s0025-5718-2014-02827-5